Nuprl Lemma : discrete-weak-precond-send-p_wf 11,40

es:ES, TA:Type, l:IdLnk, tga:Id, ds:x:Id fp Type, P:(State(ds)),
f:({s:State(ds)| (P(s))} AT).
discrete-weak-precond-send-p(es;T;A;l;tg;a;ds;P;f  
latex


Definitionsx:A  B(x), b, ES, Type, IdLnk, Atom$n, Id, a:A fp B(a), x:AB(x), e@iP(e), xdom(f). v=f(x  P(x;v), @i discrete ds, s = t, if b then t else f fi , t  T, {T}, P  Q, x:AB(x), SQType(T), loc(e), s ~ t, t.1, E, (e < e'), e c e', Knd, P & Q, A c B, <ab>, , discrete state@i, State(ds), (discrete state after e), f(a), left + right, , Unit, False, True, case b of inl(x) => s(x) | inr(y) => t(y), A, isrcv(e), sender(e), let x,y = A in B(x;y), e loc e' , (e <loc e'), P  Q, EqDecider(T), EOrderAxioms(Epred?info), EState(T), kindcase(ka.f(a); l,t.g(l;t) ), Msg(M), type List, , , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r  s, constant_function(f;A;B), Top, x:AB(x), rcv(l,tg), kind(e), {x:AB(x)} , xt(x), locl(a), source(l), P  Q, P  Q, val(e), state@i, (state when e), valtype(e), (discrete state when e), x.A(x), f(x), @i(x:T), IdDeq, x  dom(f), vartype(i;x), f(x)?z, discrete-weak-precond-send-p(es;T;A;l;tg;a;ds;P;f), T
Lemmases-dstate wf, es-state-when-dstate-when, squash wf, decl-state wf, bool wf, fpf wf, Id wf, IdLnk wf, event system wf, es-vartype wf, fpf-cap wf, top wf, lsrc wf, subtype rel wf, es-E wf, es-valtype wf, locl wf, es-dds wf, fpf-dom wf, id-deq wf, es-dtype wf, fpf-ap wf, fpf-trivial-subtype-top, es-dstate-when wf, es-state-when wf, es-state-subtype2, es-val wf, es-isrcv-loc, Knd sq, alle-at wf, Knd wf, es-kind wf, rcv wf, es-loc wf, es-causle wf, es-causl wf, es-locl wf, es-le wf, es-sender wf, es-kind-rcv, not wf, true wf, false wf, assert wf, es-dstate-after wf, es-dstate-subtype, Id sq

origin